Embedding path designs in 4-cycle systems
نویسنده
چکیده
Let (W, C) be an m-cycle system of order n and let Ω ⊂ W , |Ω| = v < n. We say that a path design (Ω,P) of order v and block size s (2 ≤ s ≤ m− 1) is embedded in (W, C) if for every p ∈ P there is an m-cycle c = (a1, a2, . . . , am) ∈ C such that: (1) p = [ak, ak+1, . . . , ak+s−1] for some k ∈ {1, 2, . . . ,m} (i.e. the (s− 1)-path p occurs in the m-cycle c); and (2) ak−1, ak+s ∈ Ω. Note that in (1) and (2) all the indices are reduced to the range {1, . . . ,m} (mod m). For each n ≡ 1 (mod 8) and for each s ∈ {2, 3}, the spectrum of all the integers v such that there is a handcuffed design of order v and block size s embedded in a 4-cycle system of order n is determined in [5]. In this paper we want to complete the case m = 4 by determining the set of all the integers v such that there is a path design of order v and block size 3 embedded in a 4-cycle system of order n. AMS classification: 05B05.
منابع مشابه
Exact embedding of two G-designs into a (G+e)-design
Let G be a connected simple graph and let SG be the spectrum of integers v for which there exists a G-design of order v. Put e = {x, y}, with x ∈ V (G) and y 6∈ V (G). Denote by G + e the graph having vertex set V (G) ∪ {y} and edge set E(G) ∪ {e}. Let (X,D) be a (G+e)-design. We say that two G-designs (Vi,Bi), i = 1, 2, are exactly embedded into (X,D) if X = V1 ∪ V2, |V1 ∩ V2| = 0 and there is...
متن کاملOn some colouring of 4-cycle systems with specified block colour patterns
The present paper continues the study (begun by Quattrocchi, Colouring 4-cycle systems with specified block colour pattern: the case of embedding P3-designs, Electron. J. Combin., 8 (2001)) of 4-cycle systems with specified block colour patterns that are also strict colourings in the sense of Voloshin (Coloring Mixed Hypergraphs: Theory, Algorithms and Applications, American Mathematical Societ...
متن کاملEmbedding path designs into a maximum packing of K n with 4 - cycles ∗ Gaetano Quattrocchi
A packing of Kn with copies of C4 (the cycle of length 4), is an ordered triple (V, C, L), where V is the vertex set of the complete graph Kn, C is a collection of edge-disjoint copies of C4, and L is the set of edges not belonging to a block of C. The number n is called the order of the packing and the set of unused edges L is called the leave. If C is as large as possible, then (V, C, L) is c...
متن کاملA RELIABILITY APPROACH TO COMPARE OPTIMAL SEISMIC DESIGNS OF MULTIPLE-TUNED-MASS-DAMPER
Passive systems are preferred tools for seismic control of buildings challenged by probabilistic nature of the input excitation. However, other types of uncertainty still exist in parameters of the control device even when optimally tuned. The present work concerns optimal design of multiple-tuned-mass-damper embedded on a shear building by a number of meta-heuristics. They include well-known g...
متن کاملColouring 4 - cycle systems with specified block colour patterns : the case of embedding P 3 - designs ∗ Gaetano
A colouring of a 4-cycle system (V,B) is a surjective mapping φ : V → Γ. The elements of Γ are colours. If |Γ| = m, we have an m-colouring of (V,B). For every B ∈ B, let φ(B) = {φ(x)|x ∈ B}. There are seven distinct colouring patterns in which a 4-cycle can be coloured: type a (××××, monochromatic), type b (×××2, two-coloured of pattern 3 + 1), type c (× × 22, two-coloured of pattern 2 + 2), ty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 255 شماره
صفحات -
تاریخ انتشار 2002